A note on fixpoint techniques in data base recursive logic programs
نویسندگان
چکیده
منابع مشابه
A Fixpoint Characterization of Abductive Logic Programs
This is a revised and extended version of the paper [19] which was presented at the Tenth International Conference on Logic Programming, Budapest, June 21{25, 1993. Address correspondence to Katsumi Inoue, Department of Information and Computer Sciences, Toyohashi University of Technology, Tempaku-cho, Toyohashi 441, Japan. E-mail: [email protected] y Chiaki Sakama, Department of Computer ...
متن کاملA Fixpoint Semantics for Disjunctive Logic Programs
D We present a fixpoint semantics for disjunctive logic programs. We extend the concept of the Herbrand base of a logic program to consist of all positive clauses that may be formed using the atoms in the Herbrand base. A monotonic closure operator is defined, operating on the lattice formed by the power set of the extended Herbrand base. The closure operator is shown to achieve a least fixpoin...
متن کاملThe Differential Fixpoint of General Logic Programs
We present a version of the alternating xpoint procedure that is fully incremental. Using ideas of partial evaluation techniques we can compute the well-founded model of logic programs with negation bottom-up without any recomputations. Further extensions of the semantics, e.g. to stable models or disjunctive programs are possible this way. We show how to implement the algorithm eeciently using...
متن کاملFragments of Fixpoint Logic on Data Words
We study fragments of a μ-calculus over data words whose primary modalities are ‘go to next position’ (Xg), ‘go to previous position’ (Yg), ‘go to next position with the same data value’ (Xc), ‘go to previous position with the same data value (Yc)’. Our focus is on two fragments that are called the bounded mode alternation fragment (BMA) and the bounded reversal fragment (BR). BMA is the fragme...
متن کاملFixpoint semantics and optimization of recursive Datalog programs with aggregates
A very desirable Datalog extension investigated by many researchers in the last thirty years consists in allowing the use of the basic SQL aggregates min, max, count and sum in recursive rules. In this paper, we propose a simple comprehensive solution that extends the declarative least-fixpoint semantics of Horn Clauses, along with the optimization techniques used in the bottom-up implementatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1988
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1988220100491